Recursive Set-Membership State Estimation Over a FlexRay Network

نویسندگان

چکیده

In this article, we investigate the set-membership state estimation problem for a class of time-varying systems with non-Gaussian noises over FlexRay network. To mitigate communication load and improve flexibility data scheduling, protocol (FRP) governed by both time-triggered event-triggered rules is exploited to regulate signal transmission in cyclic fashion. A new expression input estimator formulated intention account effect FRP. Accordingly, multirate model (orchestrating sampling/updating rates target plant, sensors, estimator) proposed then transformed into single-rate one help lifting technique vector augmentation method. Subsequently, sufficient conditions are provided true states always reside an ellipsoid at each time instant presence noises, such minimized matrix-trace sense. An online optimization algorithm developed parameterize gains means solution certain recursive matrix inequalities. Numerical results demonstrate validity protocol-based design scheme.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set-membership state estimation with fleeting data

This paper deals with offline nonlinear state estimation where measurements are available only when some given equality conditions are satisfied. For this type of problems, which are often met in robot localization when sonar or radar are involved, the data are qualified as fleeting because the measurements are available only at some given unknown dates. In this paper, the first approach able t...

متن کامل

Set-Membership State Estimation with Optimal Bounding Ellipsoids1

| This paper presents a set-membership state estimation scheme for linear systems with unknown but bounded inputs and noise. The approach is to compute 100% conndence regions for the state vector in the form of optimal ellipsoidal sets in the state-space. The proposed algorithm entails greatly reduced computational complexity in comparison to other state estimation schemes (e.g., Schweppe's alg...

متن کامل

A constraint selection technique for recursive set membership identification

Recursive approximation of the set of feasible parameters is a key problem in set membership identification. In this paper a new technique is presented, aimed at recursively computing an outer orthotopic approximation of polytopic feasible parameter sets. The main idea is to exploit the concept of binding constraints in linear programs, in order to select a limited number of constraints providi...

متن کامل

Set Membership Estimation of Nonlinear Regressions

In this paper we propose a method, based on a Set Membership approach, for the estimation of nonlinear regressions models. At the contrary of most of the existing identi...cation approaches, the method presented in this paper does not need any assumption about the functional form of the model to be identi...ed, but uses only some prior information on its regularity and on the size of noise corr...

متن کامل

Essential bibliography on Set Membership Estimation

The seminal work on set membership state estimation [1] F. C. Schweppe. Recursive state estimation: unknown but bounded errors and system inputs. [2] D. P. Bertsekas and I. B. Rhodes. Recursive state estimation for a set-membership description of uncertainty.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on systems, man, and cybernetics

سال: 2022

ISSN: ['1083-4427', '1558-2426']

DOI: https://doi.org/10.1109/tsmc.2021.3071390